Grover's algorithm can be employed in global optimization methods providing,in some cases, a quadratic speedup over classical algorithms. This paperdescribes a new method for continuous global optimization problems that uses aclassical algorithm for finding a local minimum and Grover's algorithm toescape from this local minimum. Simulations with testbed functions andcomparisons with algorithms from the literature are presented.
展开▼
